On Induced Matching Partitions of Certain Interconnection Networks
نویسندگان
چکیده
The induced matching partition number of a graph G, denoted by imp(G), is the minimum integer k such that V(G) has a k-partition (V1, V2 ... Vk ) such that, for each i, 1 ≤ i ≤ k, G[Vi], the subgraph of G induced by Vi, is a 1-regular graph. The induced matching k-partition problem is NP-complete even for k = 2. In this paper we investigate the induced matching partition problem for butterfly networks. We identify hypercubes, cube-connected cycles, grids of order m x n, where at least one of m and n is even, as graphs for which imp(G) = 2. In the sequel we prove that imp(G) does not exist for grids of order m x n where m and n are both odd and Mesh of trees MT(n), n ≥ 2.
منابع مشابه
Conditional Matching Preclusion Number of Certain Graphs
The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a graph has a neither perfect matching nor an almost perfect matching. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently the conditional matching preclusion number of a graph was introduced to look for sets beyond those induced by a single...
متن کاملA New Computer Architecture for Image Processing
This paper describes a new parallel computer architecture for image processing. The proposed architecture is capable of supporting a wide range of image processing tasks that are diverse in their computational requirements by matching the algorithm with the architecture. This versatility is achieved primarily with the use of a new storage scheme in conjunction with a new multistage interconnect...
متن کاملThe Maximum Partition Matching
Let S = fC 1 ; C 2 ; : : :; C k g be a collection of pairwise disjoint subsets of U = f1; 2; : : :; ng such that S k i=1 C i = U. A partition matching of S consists of two subsets fa 1 ; a 2 ; : : :; a m g and fb 1 ; b 2 ; : : :; b m g of U together with a sequence of distinct partitions of) such that a i is contained in a subset in the collection A i and b i is contained in a subset in the col...
متن کاملPerformance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...
متن کاملMatching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. It is natural to look for obstruction sets beyond those induced by a single vertex. The conditional matching preclusion number ...
متن کامل